Reservicing some customers in M/G/1 queues under three disciplines

نویسندگان

  • M. R. Salehi-Rad
  • Kerrie L. Mengersen
  • Gholam Hossain Shahkar
چکیده

Consider an M/G/1 production line in which a production item is failed with some probability and is then repaired. We consider three repair disciplines depending on whether the failed item is repaired immediately or first stockpiled and repaired after all customers in the main queue are served or the stockpile reaches a specified threshold. For each discipline, we find the probability generating function (p.g.f.) of the steady-state size of the system at the moment of departure of the customer in the main queue, the mean busy period, and the probability of the idle period.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Time-Dependent Properties of Symmetric M/G/1 Queues

Consider an M/G/1 queue which is idle at time 0. The number of customers sampled at an independent exponential time is shown to have the same geometric distribution under the preemptive resume last in first out (LIFO) and the processor sharing (PS) disciplines. Hence, the marginal distribution of the queue length at any time is identical for both disciplines. We then give a detailed analysis of...

متن کامل

Optimization of M G 1 Queue with Vacation (TECHNICAL NOTE)

This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...

متن کامل

M/G/1 Priority Queues

We examine an M/G/1 queue with several queueing disciplines. After reviewing some background material in probability theory, we consider a first-come first-served queue. Next, we examine an absolute priority queue, where high priority customers are always selected for service over lower priority customers, regardless of how long the latter have been waiting. We also review a method for calculat...

متن کامل

Unreliable bulk retrial queues with delayed repairs and modified vacation policy

The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...

متن کامل

Matrix Product-Form Solutions for LCFS Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams

This paper considers three variants of last-come first-served (LCFS) preemptive service single-server queues, where customers are served under the LCFS preemptive resume (LCFS-PR), preemptive repeat-different (LCFS-PD), and preemptive repeat-identical (LCFS-PI) disciplines, respectively. These LCFS queues are fed by multiple batch Markovian arrival streams. Service times of customers from each ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Math. Mathematical Sciences

دوره 2004  شماره 

صفحات  -

تاریخ انتشار 2004